Evaluation of some degree based topological indices of boron kagome lattice
نویسندگان
چکیده
The technique of securing information or data in the form images, codes, merging words etc are closely related to disciplines cryptanalysis and cryptology. Analogous this numerical encoding chemical structure, connected topological indices is also growing significantly field graph theory. One salient features predict characteristics prescribed by molecule's structure. In paper, we calculate two-dimensional Boron Kagome Lattice M- polynomial. Further, graphical representation
منابع مشابه
M-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملm-polynomial and degree-based topological indices
let $g$ be a graph and let $m_{ij}(g)$, $i,jge 1$, be the number of edges $uv$ of $g$ such that ${d_v(g), d_u(g)} = {i,j}$. the {em $m$-polynomial} of $g$ is introduced with $displaystyle{m(g;x,y) = sum_{ile j} m_{ij}(g)x^iy^j}$. it is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملM-Polynomial and Degree-Based Topological Indices
Let G be a graph and let mij(G), i, j ≥ 1, be the number of edges uv of G such that {dv(G), du(G)} = {i, j}. TheM -polynomial ofG is introduced withM(G;x, y) = ∑ i≤j mij(G)x y . It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular case to the single problem of determining the M -polyn...
متن کاملSome Topological Indices of Nanostar Dendrimers
Wiener index is a topological index based on distance between every pair of vertices in a graph G. It was introduced in 1947 by one of the pioneer of this area e.g, Harold Wiener. In the present paper, by using a new method introduced by klavžar we compute the Wiener and Szeged indices of some nanostar dendrimers.
متن کاملExtremal problems for degree-based topological indices
For a graph G, let σ(G) = ∑ uv∈E(G) 1 √ dG(u)+dG(v) ; this defines the sum-connectivity index σ(G). More generally, given a positive function t, the edge-weight t-index t(G) is given by t(G) = ∑ uv∈E(G) t(ω(uv)), where ω(uv) = dG(u) + dG(v). We consider extremal problems for the t-index over various families of graphs. The sum-connectivity index satisfies the conditions imposed on t in each ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Science and Research Archive
سال: 2022
ISSN: ['2582-8185']
DOI: https://doi.org/10.30574/ijsra.2022.7.2.0228